Gossiping Capabilities

نویسندگان

  • Davide Frey
  • Rachid Guerraoui
  • Anne-Marie Kermarrec
  • Martin Mogensen
  • Maxime Monod
  • Vivien Quéma
چکیده

Gossip-based protocols are now acknowledged as a sound basis to implement collaborative high-bandwidth content dissemination: content location is disseminated through gossip, the actual contents being subsequently pulled. In this paper, we present HEAP, HEterogeneity-Aware Gossip Protocol, where nodes dynamically adjust their contribution to gossip dissemination according to their capabilities. Using a continuous, itself gossip-based, approximation of relative capabilities, HEAP dynamically leverages the most capable nodes by (a) increasing their fanouts (while decreasing by the same proportion those of less capable nodes) and (b) employing them early in the dissemination chain. These, on the other hand, have an incentive to take on additional load as being first in the chain improves their perceived quality. A lightweight accountability mechanism is used to track selfish nodes that might declare a high capability in order to augment their perceived quality without contributing accordingly. We evaluate HEAP in the context of a video streaming application on a 236 PlanetLab nodes testbed. Our results shows that HEAP improves the quality of the streaming by 25% over a standard gossip protocol without impacting the average load or availability of the system.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An important and influential survey situating human social organization within the broader matrix of primate social organization

Recent empirical and theoretical work suggests that reputation was an important mediator of access to resources in ancestral human environments. Reputations were built and maintained by the collection, analysis, and dissemination of information about the actions and capabilities of group members—that is, by gossiping. Strategic gossiping would have been an excellent strategy for manipulating re...

متن کامل

Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks

We present a mobility resilient deterministic broadcast algorithm with worst-case time complexity of O(n log n) for ad hoc networks where the nodes possess collision detection capabilities, n being the total number of nodes in the network. The algorithm is based on a breadth-first traversal of the network and allows multiple simultaneous transmissions by the nodes. The idea of this broadcast al...

متن کامل

Gossiping with Bounded Size Messages in ad hoc Radio Networks

We study deterministic algorithms for the gossiping problem in ad hoc radio networks under the assumption that each combined message contains at most b(n) single messages or bits of auxiliary information, where b is an integer function and n is the number of nodes in the network. We term such a restricted gossiping problem b(n)-gossiping. We show that √ n-gossiping in an ad hoc radio network on...

متن کامل

Time and Cost Trade-Offs in Gossiping

Each of n processors has a value which should be transmitted to all other processors. This fundamental communication task is called gossiping. In a unit of time every processor can communicate with at most one other processor and during such a transmission each member of a communicating pair learns all values currently known to the other. Two important criteria of efficiency of a gossiping algo...

متن کامل

New bounds on the minimum calls of failure-tolerant gossiping

Gossiping is an extensively investigated information dissemination process. In gossiping, every vertex holds a message which has to be transmitted to all other vertices. This paper deals with k-failure tolerant gossiping, which investigates the minimum number of transmissions (calls) required by the communication process, provided that at most k transmissions may fail. We show new bounds for th...

متن کامل

Anonymous Gossiping

In this paper we introduce a novel gossiping primitive to support privacy preserving data analytics (PPDA). In contrast to existing computational PPDA primitives such as secure multiparty computation and data randomization based approaches, the proposed primitive “anonymous gossiping” is a communication primitive for privacy preserving personalized information aggregation complementing such tra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008